Formal Specification and Verification of Timed Communicating Systems
نویسنده
چکیده
منابع مشابه
Specification, validation, and verification of time-critical systems
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserves the advantages of CFSM, such as the ability to express communication, synchronization and concurrency in computer systems. A given time-dependent specification can be formalized as a Timed CFSM, from which the reacha...
متن کاملThe automated verification of timewise refinement (Draft)
While Hoare’s CSP models reactive systems without assigning an exact time to events, Timed CSP records the exact times as nonnegative reals. Timed CSP therefore provides a more exact semantics of systems, but it still makes sense to ask whether a timed process satisfies an untimed specification. Indeed the question of whether such specifications are satisfied often reduces to the timing details...
متن کاملWeb Service Choreography Verification Using Z Formal Specification
Web Service Choreography Description Language (WS-CDL) describes and orchestrates the services interactions among multiple participants. WS-CDL verification is essential since the interactions would lead to mismatches. Existing works verify the messages ordering, the flow of messages, and the expected results from collaborations. In this paper, we present a Z specification of WS-CDL. Besides ve...
متن کاملContents Session 1 : Verification 5 1 . 1 Cost Monadic Logic
This paper describes the automated translation of timed automata to tock-CSP. This translation has been implemented in a translator. The tock-CSP output of the translator can be input to FDR for the automated verification of properties of the input timed automata. It has been shown, by the use of the digitization technique, that there are relationships between Timed Automata and tock-CSP. Preli...
متن کاملMeeting Deadlines Together
This paper studies safety, progress, and non-zeno properties of Communicating Timed Automata (CTAs), which are timed automata (TA) extended with unbounded communication channels, and presents a procedure to build timed global specifications from systems of CTAs. We define safety and progress properties for CTAs by extending properties studied in communicating finitestate machines to the timed s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006